Partitioning a graph into monochromatic connected subgraphs
نویسندگان
چکیده
منابع مشابه
Partitioning a Graph into Highly Connected Subgraphs
Given k ≥ 1, a k-proper partition of a graph G is a partition P of V (G) such that each part P of P induces a k-connected subgraph of G. We prove that if G is a graph of order n such that δ(G) ≥ √ n, then G has a 2-proper partition with at most n/δ(G) parts. The bounds on the number of parts and the minimum degree are both best possible. We then prove that If G is a graph of order n with minimu...
متن کاملOn Partitioning a Graph into Two Connected Subgraphs
Suppose a graph G is given with two vertex-disjoint sets of vertices Z1 and Z2. Can we partition the remaining vertices of G such that we obtain two connected vertex-disjoint subgraphs of G that contain Z1 and Z2, respectively? This problem is known as the 2-Disjoint Connected Subgraphs problem. It is already NP-complete for the class of n-vertex graphs G = (V, E) in which Z1 and Z2 each contai...
متن کاملHighly connected monochromatic subgraphs
We conjecture that for n> 4(k−1) every 2-coloring of the edges of the complete graphKn contains a k-connectedmonochromatic subgraph with at least n − 2(k − 1) vertices. This conjecture, if true, is best possible. Here we prove it for k = 2, and show how to reduce it to the case n< 7k − 6. We prove the following result as well: for n> 16k every 2-colored Kn contains a k-connected monochromatic s...
متن کاملPartitioning a graph into degenerate subgraphs
Let G = (V,E) be a graph with maximum degree k ≥ 3 distinct from Kk+1. Given integers s ≥ 2 and p1, . . . , ps ≥ 0, G is said to be (p1, . . . , ps)-partitionable if there exists a partition of V into sets V1, . . . , Vs such that G[Vi] is pi-degenerate for i ∈ {1, . . . , s}. In this paper, we prove that we can find a (p1, . . . , ps)-partition of G in O(|V |+|E|)-time whenever 1 ≥ p1, . . . ,...
متن کاملOn the complexity of partitioning a graph into a few connected subgraphs
Given a graph G, a sequence τ = (n1, ..., np) of positive integers summing up to |V (G)| is said to be realizable in G if there exists a realization of τ in G, i.e. a partition (V1, ..., Vp) of V (G) such that each Vi induces a connected subgraph of G on ni vertices. We first give a reduction showing that the problem of deciding whether a sequence with c elements is realizable in a graph is NP-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2018
ISSN: 0364-9024,1097-0118
DOI: 10.1002/jgt.22435